A New Parallel Genetic Algorithm

نویسندگان

  • Ling Tan
  • David Taniar
  • Kate Smith-Miles
چکیده

One problem of propagating the globally fittest individual via neighbourhood evolving in both island model and cellular model of existing parallel genetic algorithms (PGA) is that the migration of globally best individual is delayed to non-adjacent processors. That may cause inferior search in those sub-populations. The propagation delay of the globally best individual is proportional to the network distance between two processors. Delayed migration of best individual in parallel genetic algorithms is an essential deviation from sequential version of genetic algorithm, in which the best individuals are always used to compete with other individuals. To solve this problem, this paper proposes an extended version of island parallel genetic algorithm, Virtual Community PGA (VC-PGA). In this paper, VCPGA is applied in a case study of optimizing parameters of back-propagation neural network classifier.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A New Approach to Solve N-Queen Problem with Parallel Genetic Algorithm

Over the past few decades great efforts were made to solve uncertain hybrid optimization problems. The n-Queen problem is one of such problems that many solutions have been proposed for. The traditional methods to solve this problem are exponential in terms of runtime and are not acceptable in terms of space and memory complexity. In this study, parallel genetic algorithms are proposed to solve...

متن کامل

A New ILP Model for Identical Parallel-Machine Scheduling with Family Setup Times Minimizing the Total Weighted Flow Time by a Genetic Algorithm

This paper presents a novel, integer-linear programming (ILP) model for an identical parallel-machine scheduling problem with family setup times that minimizes the total weighted flow time (TWFT). Some researchers have addressed parallel-machine scheduling problems in the literature over the last three decades. However, the existing studies have been limited to the research of independent jobs,...

متن کامل

A Genetic-Fuzzy Control Strategy for Parallel Hybrid Electric Vehicle

Hybrid Electric Vehicles (HEVs) are driven by two energy convertors, i.e., an Internal Combustion (IC) engine and an electric machine. To make powertrain of HEV as efficient as possible, proper management of the energy elements is essential. This task is completed by HEV controller, which splits power between the IC engine and Electric Motor (EM). In this paper, a Genetic-Fuzzy control strategy...

متن کامل

A New Hybrid Meta-Heuristics Approach to Solve the Parallel Machine Scheduling Problem Considering Human Resiliency Engineering

This paper proposes a mixed integer programming model to solve a non-identical parallel machine (NIPM) scheduling with sequence-dependent set-up times and human resiliency engineering. The presented mathematical model is formulated to consider human factors including Learning, Teamwork and Awareness. Moreover, processing time of jobs are assumed to be non-deterministic and dependent to their st...

متن کامل

A Memtic genetic algorithm for a redundancy allocation problem

Abstract In general redundancy allocation problems the redundancy strategy for each subsystem is predetermined. Tavakkoli- Moghaddam presented a series-parallel redundancy allocation problem with mixing components (RAPMC) in which the redundancy strategy can be chosen for individual subsystems. In this paper, we present a bi-objective redundancy allocation when the redundancy strategies for...

متن کامل

Design of a Hybrid Genetic Algorithm for Parallel Machines Scheduling to Minimize Job Tardiness and Machine Deteriorating Costs with Deteriorating Jobs in a Batched Delivery System

This paper studies the parallel machine scheduling problem subject to machine and job deterioration in a batched delivery system. By the machine deterioration effect, we mean that each machine deteriorates over time, at a different rate. Moreover, job processing times are increasing functions of their starting times and follow a simple linear deterioration. The objective functions are minimizin...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2002